-
1 interpolation search
алгоритм поиска, предполагающий, что значения в массиве, по которому идёт поиск, растут линейно. Это даёт возможность вычислить индекс элемента, наиболее близкого к значению ключа поискасм. тж. searchАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > interpolation search
-
2 interpolation
1) интерполирование, интерполяцияа) вычисление промежуточных значений между двумя известными точками данных. Наиболее часто используется линейная (linear interpolation) и экспоненциальная (exponential interpolation) интерполяцияб) в ЦОС - увеличение частоты дискретизации (sampling rate) в целое число разв) в КГА - генерация дополнительных (промежуточных) пикселов изображения с целью создания иллюзии более высокого разрешения при помощи специального алгоритма, задающего цвет каждого дополнительного пиксела с учётом цветов его окруженияг) в DVD-Video - создание дополнительных пикселов, строк развёртки (сканирования) или картинок (кадров) путём усреднения параметров соседних пикселов, строк или картинок и их вставление в изображение или видеопоследовательность для масштабирования (изменения масштаба). Как правило, это приводит к смягчению вида неподвижных и к размыванию движущихся изображений, поскольку при интерполировании новая информация не возникаетAnt:2) вставка, вставленный фрагмент (в текст документа)Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > interpolation
-
3 search algorithm
см. тж. A* search, advanced search, backward search, binary search, cache of states, concept search, contextual search, fuzzy search, global search, heuristic search, hybrid search, interpolation search, keyword search, linear search, pattern-matching search, power search, proximity search, search, search rule, search time, simple search, state space searchАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > search algorithm
-
4 method
метод; процедура; способ- antithetic variate method - average ordinate method - average range method - binary search method - conjugate directions method - conjugate gradient method - control chart method - conventional milling method - correlation function method - decision function method - differential control method - Feynman diagram method - first approximation method - gradient projection method - iterative method - large sample method - large sieve method - least-squares regression method - less than fully efficient method - linearly implicit method - method of adjoint gradient - method of algebraic addition - method of alternating directions - method of balanced blocks - method of complex numbers - method of confidence intervals - method of conformal mappings - method of conjugate directions - method of conjugate gradients - method of cyclic descent - method of detached coefficients - method of disjunction of cases - method of divided differences - method of electrical images - method of elimination of quantifiers - method of empty ball - method of extreme values - method of false position - method of feasible directions - method of finite differences - method of first approximation - method of first entrance - method of fitting constants - method of fixed points - method of full enumeration - method of generating functions - method of geometric exhaustion - method of indefinite coefficients - method of infinite descent - method of interval bisection - method of least absolute values - method of least distance - method of least likelihood - method of maximum likelihood - method of means and standard deviations - method of medians and extreme values - method of minimal change - method of minimal variance - method of mirror reflections - method of moving frame - method of multiple comparison - method of orthogonal projections - method of paired associates - method of paired comparisons - method of phase integrals - method of projecting cones - method of proportional parts - method of rotating factors - method of semantic tableaux - method of separation of variables - method of simulaneous displacements - method of stationary phase - method of statistical differentials - method of statistical inference - method of steep variations - method of steepest ascent - method of stochastic approximation - method of straightforward iteration - method of successive displacements - method of successive divisions - method of successive elimination - method of transfinite induction - method of unweighted means - method of variable differences - method of variation of parameters - method of weighted residuals - optimum method - parallel tangents method - precision method - random walk method - recursive method - reduced gradient method - reflected wave method - relative method of measurement - sampling method by variables - statistical sampling method - steepest descent method - time average method -
5 DSI
1) [data search information] информация для системы поиска данных2) [digital signal interpolation, digital speech interpolation] цифровая интерполяция речи; статистическое уплотнение цифровых голосовых сигналов, статистическое уплотнение цифровых речевых сигналов -
6 DSI
1) сокр. от data search information информация для системы поиска данных2) сокр. от digital signal interpolation, digital speech interpolation цифровая интерполяция речи; статистическое уплотнение цифровых голосовых сигналов, статистическое уплотнение цифровых речевых сигналовThe New English-Russian Dictionary of Radio-electronics > DSI
-
7 technique
-
8 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
9 DSI
1) Digital Speech Interpolation - цифровая интерполяция речи, метод DSIпредусматривает "квантование" речи (нарезание речевого потока на кванты) и передачу её содержательных битов только тогда, когда произносятся слова; во время пауз одного абонента производится передача речи других абонентов - благодаря этому повышается реальная пропускная способность, например, В-канала (B-channel) сети ISDN2) data search information - информация для поиска данных [ DVD]служебная навигационная и поисковая информация, содержащаяся в потоке данных DVD-Video; вместе с презентационной управляющей информацией (см. PCI)Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > DSI
См. также в других словарях:
Interpolation search — is an algorithm for searching for a given key value in an indexed array that has been ordered by the values of the key. It parallels how humans search through a telephone book for a particular name, the key value by which the book s entries are… … Wikipedia
Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… … Wikipedia
Jump search — In computer science, a jump search or block search refers to a search algorithm for ordered lists. It works by first checking all items L km , where k in mathbb{N} and m is the block size, until an item is found that is larger than the search key … Wikipedia
Ternary search tree — In computer science, a ternary search tree (trie,TST) is a ternary (three way) tree data structure which combines the time efficiency of digital tries with the space efficiency of binary search trees. The resulting structure is faster than… … Wikipedia
Ternary search — A ternary search algorithm is a computer science technique for finding the minimum or maximum of a function that is either strictly increasing and then strictly decreasing or vice versa. A ternary search determines either that the minimum or… … Wikipedia
Cuckoo search — (CS) is an optimization algorithm developed by Xin she Yang and Suash Deb in 2009.[1][2] It was inspired by the obligate brood parasitism of some cuckoo species by laying their eggs in the nests of other host birds (of other species). Some host… … Wikipedia
Lebesgue constant (interpolation) — For other uses, see: Lebesgue constant. In mathematics, the Lebesgue constants (depending on a set of nodes and of its size) give an idea of how good the interpolant of a function (at the given nodes) is in comparison with the best polynomial… … Wikipedia
Nearest-neighbor interpolation — (blue lines) in one dimension on a (uniform) dataset (red points) … Wikipedia
Successive parabolic interpolation — is a technique for finding the extremum (minimum or maximum) of a continuous unimodal function by successively fitting parabolas (polynomials of degree two) to the function at three unique points, and at each iteration replacing the oldest point… … Wikipedia
Nearest neighbor search — (NNS), also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces. The problem is: given a set S of points in a metric space M and a query point… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
